Method and apparatus for locating a remote unit within a communication system

ABSTRACT

A base station (101) calculates a location of a remote unit (113) using a first location technique. The first location technique is a single-site estimation of a PN offset for the remote unit (PN primary .sbsb.-- site ). PN primary .sbsb.-- site  is then forwarded by the base station (101), along with its base station identification, to locating equipment (107). Equipment (107) then passes a second location request to the serving base station (101) and those base stations neighboring the serving base station (neighbor base stations). PN primary .sbsb.-- site  is sent with the second location request, along with an identity of the base station that made the first location estimate. The neighboring base stations then calculate a &#34;search window&#34; for each base station to search when locating the remote unit (113). The search range is based on the first location, and the identity of the base station that made the first location estimate.

CROSS REFERENCE TO RELATED CO-PENDING APPLICATIONS

This application is a related application to a co-pending application entitled "Method and Apparatus for Locating a Remote Unit Within a Communication System" having inventors Pfeil et al., serial number 09/409,454, filed on Sep. 30, 1999, owned by instant assignee and hereby incorporated in its entirety by reference.

1. Field of the Invention

The present invention relates generally to communication systems and, in particular, to a method and apparatus for locating a remote unit within a communication system.

2. Background of the Invention

Radio location techniques have been widely used in many mobile transmitter location systems (e.g., Loran-C). There are three primary methods used to determine the location of a remote unit within a communication system, namely the a) Time of Arrival (TOA), b) Time Difference of Arrival (TDOA) methods, and c) Angle of Arrival (AOA) methods.

TOA Method for Location: When the distances x₁ and X₂ between a remote unit and a pair of fixed base stations are known, the position of the remote unit may be computed by determining the point of intersection of two circles with radii x₁ and x₂, each centered at one of the fixed base stations. If an error exists in either or both distance determinations, the true position of the remote unit, P, will be displaced and observed to lie at the intersection P', of the perturbed radial arcs x₁₁ and x₁₂. A third base station is typically needed to unambiguously locate each remote unit at the unique point of intersection of the three circles. To accurately compute the remote unit location using this method, it is necessary to know precisely the instant the signal is emitted from the base stations and the instant it arrives at the remote unit. For this method to work properly, an accurate measurement of the total time delay along each of three remote unit to base station signal paths is necessary.

TDOA Method for Location: For this method of location, the observed time difference between pairs of signals arriving at the remote unit from three or more base stations are used to compute the location of the remote unit. The remote unit, by observing the time difference in arriving signals between base station pairs, can establish the hyperbolae or "lines of position" (LOPs'). In this method therefore, the location estimate can be obtained without knowledge of the absolute arrival time of the signal from each base station at the remote unit, only time differences in arrival are significant.

AOA Method for Location: AOA location is described in U.S. Pat. No. 4.636,796, RADIO DIRECTION FINDING SYSTEM, by Imazeki and U.S. Pat. No. 4,833,478, AUTOMATIC DIRECTION FINDER ANTENNA ARRAY, by Nossen. According to such a method, the angle of arrival of a signal transmitted from a remote unit is determined by analyzing the amplitude (or phase) differences between multiple antennas at a base site. Antennas in one sector will receive the remote unit's signal at a different angle of arrival than antennas in other sectors. It is the difference in received amplitudes (or phases) of the remote unit's signal at various antennas that is utilized in determining the angle of arrival of the signal. A look-up table may be used to equate the measured amplitude₋₋ (or phase) difference to an angle of arrival.

TOA and TDOA location methods require intensive processing of multiple base stations to calculate arrival times for a particular remote unit. Although AOA does not require intensive processing of multiple base stations, AOA location techniques are not as accurate as TOA or TDOA methods of location. Therefore, a need exists for a method and apparatus for locating a remote unit within a communication system that is highly accurate, yet does not require the intensive processing as prior-art TOA or TDOA methods of location.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a communication system in accordance with the preferred embodiment of the present invention.

FIG. 2 illustrates the generation of both a search window and a correlation window in accordance with the preferred embodiment of the present invention.

FIG. 3 is a block diagram of a base station of FIG. 1 in accordance with the preferred embodiment of the present invention.

FIG. 4 is a flow chart showing the generation of a search window by the base station of FIG. 1 in accordance with the preferred embodiment of the present invention.

FIG. 5 illustrates the generation of a search window for the Rake receivers of FIG. 2 in accordance with the preferred embodiment of the present invention.

FIG. 6 illustrates the generation of a search window for the Rake receivers of FIG. 2 in accordance with the preferred embodiment of the present invention.

FIG. 7 is a flow chart showing the generation of a correlation window by the base station of FIG. 1 in accordance with the preferred embodiment of the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

To address the above-mentioned need, a method and apparatus for locating a remote unit is provided herein. A base station calculates a location of a remote unit using a first location technique. The first location technique is a single-site estimation of a PN offset for the remote unit (PN_(primary).sbsb.--_(site)). PN_(primary).sbsb.--_(site) is then forwarded by the base station along with its base station identification, to locating equipment. Equipment then passes a second location request to the serving base station and those base stations neighboring the serving base station (neighbor base stations). PN_(primary).sbsb.--_(site) is sent with the second location request, along with an identity of the base station that made the first location estimate. The neighboring base stations then calculate a "search window" for each base station to search when locating the remote unit. It should be noted that each base station's search window typically differs, and is determined independently of the other base stations calculating a search window. Additionally, the search window is a limited search window based on the first location, and the identity of the base station (and hence known base site location) that made the first location estimate.

Because all base stations limit their search window when performing TDOA location techniques, a highly accurate location method can be performed without requiring the intensive processing of prior-art TOA or TDOA methods of location. More particularly, this technique significantly reduces the `cold search` range over which remote base site's location finding algorithms must perform asic/mips-intensive algorithms. The `cold search` range, if unconstrained, extends beyond the typical range of communication channels. Furthermore, sensitivity requirements are greater for the location searcher than communications modems since they must seek and acquire signals below sensitivities of communications modems. Although the known recovered signal is provided by the serving site, further despreading gain is required and hence the need to deploy resources over as narrow a window as possible.

The present invention encompasses a method for locating a remote unit within a communication system. The method comprises the steps of receiving at a base station, a location request to perform a location of the remote unit. In the preferred embodiment of the present invention the location request comprises a first location of the remote unit. After the location request is received, a location of the remote unit is performed within a search window that is based on the location request, the first location of the remote unit, and a distance from the base station to a second base station. In the preferred embodiment of the present invention the second base station performed the first location of the remote unit.

The present invention additionally encompasses a method for locating a remote unit within a communication system. The method comprises the steps of receiving at a base station, a location request to perform a location of the remote unit. In the preferred embodiment of the present invention the location request comprises a first location of the remote unit. After the location request is received a receiver is instructed to search for the remote unit within a window bounded by an upper (PN_(initial)) and a lower (PN_(final)) PN offset. PN_(initial) and PN_(final) are based on the first location of the remote unit (PN_(primary).sbsb.--_(site)) and a distance that the base station is from a second base station and the second base station performed the first location of the remote unit. A location of the remote unit is performed based on the location request, the first location of the remote unit, and a distance from the base station to a second base station.

Finally, the present invention encompasses a base station comprising a logic unit having a location request and a first location as an input and outputting a search window for utilization by a receiver. In the preferred embodiment of the present invention the search window is based on the location request, the first location of the remote unit, and a distance from the base station to a second base station, where the second base station performed the first location of the remote unit.

Turning now to the drawings, where like numerals designate like components, FIG. 1 is a block diagram of communication system 100 in accordance with the preferred embodiment of the present invention. In the preferred embodiment of the present invention, communication system 100 utilizes a Code Division Multiple Access (CDMA) system protocol as described in Cellular System Remote unit-Base Station Compatibility Standard of the Electronic Industry Association/Telecommunications Industry Association Interim Standard 95A (TIA/EIA/IS-95C). (EIA/TIA can be contacted at 2001 Pennsylvania Ave. NW Washington D.C. 20006). However, in alternate embodiments communication system 100 may utilize other digital cellular communication system protocols such as, but not limited to, the next generation CDMA architecture as described in the UMTS Wideband cdma SMG2 UMTS Physical Layer Expert Group Tdoc SMG2 UMTS-L1 221/98 (UMTS 221/98), the next generation CDMA architecture as described in the cdma2000 International Telecommunication Union-Radiocommunication (ITU-R) Radio Transmission Technology (RTT) Candidate Submission document, or the next generation Global System for Mobile Communications (GSM) protocol, the CDMA system protocol as described in "Personal Station-Base Station Compatibility Requirements for 1.8 to 2.0 GHz Code Division Multiple Access (CDMA) Personal Communication Systems" (American National Standards Institute (ANSI) J-STD-008), or the European Telecommunications Standards Institute (ETSI) Wideband CDMA (W-CDMA) protocol.

Communication system 100 includes a number of network elements such as base station 101, remote unit 113, Centralized Base Station Controller (CBSC) 103, and Mobile Switching Center (MSC) 104. In the preferred embodiment of the present invention, all network elements are available from Motorola, Inc. (Motorola Inc. is located at 1301 East Algonquin Road, Schaumburg, Ill. 60196). It is contemplated that network elements within communication system 100 are configured in well known manners with processors, memories, instruction sets, and the like, which function in any suitable manner to perform the function set forth herein.

As shown, remote unit 113 is communicating with base station 101 and 102 via uplink communication signals 119 and base station 101 is communicating with remote unit 113 via downlink communication signals 116. In the preferred embodiment of the present invention, base station 101 is suitably coupled to CBSC 103, and CBSC is suitably coupled to MSC 104, which is in turn coupled to Public Switched Telephone Network (PSTN) 105.

Operation of communication system 100 in accordance with the preferred embodiment of the present invention occurs as follows: To initiate a location request, a command is originated at a regional entity such as MSC 104, an operations center (not shown), or perhaps within a connected network such as PSTN 105. The location request, which includes identification information on the remote unit that is to be located enters Home Location Register (HLR) 106 where it is processed to determine the currently serving base station. The location request is passed from HLR 106 to the base station providing remote unit 113 with a reference pilot (e.g., base station 101) where base station 101 calculates a location of remote unit 113 using a first location technique. In the preferred embodiment of the present invention the first location technique is a channel modem's finger offsets fused with the known BTS. In other words, the first location technique is a single-site estimation of a PN offset for the remote unit (PN_(primary).sbsb.--_(site)), however in an alternate embodiments of the present invention, the initial PN offset is taken from a prompt ray/TOA search result.

Location information is then forwarded by base station 101, along with its base station identification, to locating equipment such as location searcher 107 of CBSC 103. Location searcher 107 then passes a second location request to the serving base station and those base stations neighboring the serving base station (neighbor base stations). In an alternate embodiment of the present invention, a second location request is not made. Instead all neighboring base stations simply perform the second location request automatically when the first location request is made (and upon receipt of preliminary serving site TOA estimate from the serving site to assist with windowing).

Sent with the second location request is the calculated first location (PN_(primary).sbsb.--_(site)) made by base station 101, along with an identity of the base station that made the first location estimate. The neighboring base stations then calculate a limited "search window" unique to each base station to search when locating remote unit 113. More particularly, a search range is calculated by all base stations performing location. The search range is bounded by an initial Pseudo-Noise (PN) offset (PN_(initial)) and a final PN offset (PN_(final)), and is based on the first location, and the identity of the base station that made the first location estimate. All base stations adjust their search window to look within the range between an initial (PN_(initial)) and final (PN_(final)) offsets when locating remote unit 113. All base stations then perform a second location of remote unit 113 utilizing a second location technique. In the preferred embodiment of the present invention the second location technique is a TDOA or multi-TOA data fusion technique, however other location techniques may be utilized as well.

As mentioned above, because all base stations limit their search window when performing TOA estimation (the results of which are necessary for multi-TDOA or multi-TOA data fusion location techniques), a highly accurate location method can be performed without requiring the intensive processing of prior-art TOA or TDOA methods of location. More particularly, this technique significantly reduces the `cold search` range over which remote base site's location finding algorithms must perform asic/mips-intensive algorithms. The `cold search` range, if unconstrained, extends beyond the typical range of communication channels. Furthermore, sensitivity requirements are greater for the location searcher than communications modems since they must seek and acquire signals below sensitivities of communications modems. Although the known recovered signal is provided by the serving site, further despreading gain is required. This further despreading gain implies a greater level of ASIC or DSP processing power, and hence the need to deploy resources over as narrow a window as possible.

Once a search window is identified, determining a timing offset is accomplished by comparing a known sequence (i.e., the demodulated data transmitted by the remote unit, received by the serving station, and re-distributed to the remote BTSs) to the information transmitted by the mobile and received by the remote site. In other words, as described in "CDMA Principles of Spread Spectrum Communication" by Andrew J. Viterbi, Addison-Wesley Publishing Company, 1995 ISBN 0-201-63374-4, which is incorporated by reference herein, known sequence re-modulation produces a signal which is then correlated with the remote site received baseband data to produce timing offsets. The known sequence of data is compared to the information received by remote unit 113 within the search window to determine the timing difference relative to the remote unit's internal reference, and subsequently the propagation delay and hence the distance between the mobile and the remote unit.

FIG. 2 illustrates the generation of both a search window and a correlation window in accordance with the preferred embodiment of the present invention. As shown, a sequence of transmitted data 201 has a search window of length PN_(final) -PN_(initial). Known sequence 203 is compared to transmitted data, to determine where (in transmitted data 201) known sequence 203 exists. Known sequence 203 has a specific length, referred to as a correlation window. The cross correlation between the re-modulated data and the received data is required to find the timing offset. The energy of the peak of the cross correlation is proportional to the size of the correlation window. DSP and ASIC processing power decrease with decreased window size; however, the energy of the peak also decreases with decreased window size. Because of this, an incorrect location estimate may result from excessively short window size. Therefore, it is beneficial to have a correlation window size that is large enough to detect the energy of the peak cross correlation, yet is small enough to limit DSP and ASIC processing.

With reference to FIG. 2, the correlation window length varies as a function of time offset (or distance that remote unit 113 is from the base station performing the search). In the preferred embodiment of the present invention the correlation window length is calculated as follows:

    N=N.sub.0 *[t.sub.arrival /t.sub.0 ].sup.n,

where:

N is the correlation window length;

N₀ is the reference correlation window length, which in the preferred embodiment of the present invention is a known shortest correlation window length that provides appropriate signal to noise ratio result for cross correlation energy peak at offset t₀. This value is a calibrated value that is known a priori, and is determined from the results of drive testing and analysis of environmental factors;

t_(arrival) is the arrival time offset under evaluation, and is bounded by PN_(initial) and PN_(final) ; and

t₀ is the offset at which N₀ is referenced.

Hence, the correlation window length is short when searching at PN_(initial) (i.e., t_(arrival) =PN_(initial)), and is lengthened as the distance searched increases to PN_(final) (i.e., t_(arrival) =PN_(initial)). In other words, the correlation window length is shorter when searching at closer distances to the base station, and is lengthened as the distance searched is increased.

As is evident, the correlation window length (or size of known sequence 203) is allowed to vary based on a fundamental geometry of the serving and non-serving base stations. More particularly, the correlation window is allowed to vary based on a distance between the non-serving base station and the distance offset under evaluation.

By allowing the correlation window to vary based on the distance between the non-serving base stations and the distance/offset under evaluation, significant increases in computational throughput as well as reductions in ASIC/DSP processing requirements are obtained.

FIG. 3 is a block diagram of a base station of FIG. 1 in accordance with the preferred embodiment of the present invention. Base station 101 has a common RF front end 305 that feeds three independent rake inputs, shown as 310-330. These rakes (with the assistance of searcher 340) can lock onto three different received rays that are at least a PN chip time apart, which is typical of most rake receivers in CDMA systems. The rake receivers 310-330 are assigned a "window" to search via searcher 340, and with the aid of searcher 340, lock onto a remote unit's transmitted signal. As with the communication modem, the location-specific modem must run long correlation sequences over many offsets. To achieve greater despreading gain, high-gain location searchers also add the frequency offset dimension to stabilize long-duration coherent searches.

Generation of Search Window

The generation of a search window by base station 101 in accordance with the preferred embodiment of the present invention occurs as illustrated in FIG. 4. At step 401 processor 350 receives a location request from location searcher 107. As discussed above, this location request may be either a request for base station 101 to perform a single site location of remote unit 113 via single-site location techniques, or the location request may be a request for base station 101 to participate in a multi-site location of remote unit 113. Because of this, at step 403 processor 350 determines if the location request is a request for a single-site location of remote unit 113. If at step 403 processor determines that single-site location is desired, then the logic flow continues to step 405, otherwise the logic flow continues to step 4307. At step 405 processor 350 utilizes internal Location Finding Equipment (LFE) 355 to perform standard single-site location of remote unit 113, and returns a location (PN_(primary).sbsb.--_(site)) to location searcher 107, and the logic flow ends at step 413.

At step 407 processor 350 analyzes the location request, and determines a gross location of remote unit 113 (PN_(primary).sbsb.--_(site)) from the location request. In the preferred embodiment of the present invention the gross location comprises the identity of the base station that performed single-site location, along with the distance that remote unit 113 is from the base station that performed the single-site location. At step 409, processor 350 calculates an initial search window for receivers 310-330 based on the first (single-site) location of remote unit 113, and a base station that made the single-site measurement. At step 411 a correlation window size is determined and base station 101 takes part in the multi-site location of remote unit 113. The observed PN offset for remote unit 113 is reported to location searcher 107, which performs a location based on the multi-site locations of remote unit 113. The logic flow then ends at step 413.

As discussed above, because the initial guess of the search window is approximated, a broad search that uses a complex and resource-consuming search process is avoided. Thus, in accordance with the preferred embodiment of the present invention remote unit 113 can be located via an accurate TDOA technique without the intensive processing required by prior-art TOA or TDOA methods of location.

FIG. 5 illustrates the generation of search window 501 for Rake receivers 310-330 in accordance with the preferred embodiment of the present invention. Shown in FIG. 5 are base stations 101 and 102, with base station 101 setting a search window based on a distance (PN_(between).sbsb.--_(sites)) between base station 101 and 102, and a distance (PN_(primary).sbsb.--_(site)) that remote unit 113 is from base station 102. As discussed above, PN_(primary).sbsb.--_(site) is determined by base station 102 performing a single-site location technique. In the case where PN_(primary).sbsb.--_(site) does not exceed PN_(between).sbsb.--_(sites), base station 101 should instruct receivers 310-330 to search the area (window) between PN_(initial) and PN_(final), where,

    PN.sub.initial =PN.sub.between.sbsb.--.sub.sites -PN.sub.primary.sbsb.--.sub.site

    PN.sub.final =PN.sub.between.sbsb.--.sub.sites +PN.sub.primary.sbsb.--.sub.site.

In the case where PN_(primary).sbsb.--_(site) exceeds PN_(between).sbsb.--_(sites), base station 101 should instruct receivers 310-330 to search the area (window) between PN_(initial) and PN_(final), where,

    PN.sub.initial =0

    PN.sub.final =2*PN.sub.primary.sbsb.--.sub.site.

In situations where the service area of the base stations are divided by sectors, the geometry allows for the outer limit of the search window to be further reduced. This situation is illustrated in FIG. 6. If base station 101 knows a base station's bore site azimuth, sector size, and sector 601 within the base station's coverage area that a remote unit was located during single-site timing estimation, the search window can be narrowed so that the search is only performed within a range of offsets that fall within the serving sector coverage area intersected within the vicinity of the serving sector's reported timing offset. This is evident in FIG. 6 where PN_(final) does not extend outside 120° sector 501. By using geometric relationships, it can be shown that for an arbitrary site:

    PN.sub.initial =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2 -2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.-

    (β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2)

    PN.sub.final =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2-

    2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.+(β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2).

where

.o slashed.=Sector boresite (defined as the angle offset clockwise from the line connecting the two base stations under consideration, and represents the boresight of the serving base station's sector).

β=Sector Beam Width (defined as the beam width used for the serving sector. This value will typically be similar to the planned sector Beam Width, but more typically will follow the realized sector Beam Width which is dependent on antenna and environmental factors).

Generation of Correlation Window Length

As described by T. Rappaport in "Wireless Communications," pp. 104, Prentice Hall, N.J., 1996, the path loss (PL) at any particular distance (d) is random and distributed log-normally (normal in dB) about a mean distance-dependent value. More particularly,

    PL(d)=PL(d.sub.0)+10nlog(d/d.sub.0)+X.sub.σ,

where the use of d₀ provides a known (measured) power reference. In other words, the path loss at d=d₀ is simply PL(d₀)+X.sub.σ. The variable d is the distance under evaluation, and n is the coefficient that depends on the specific propagation environment (see table 1). In the preferred embodiment of the present invention, n is the best fit to the free space propagation, environment factors shown in the table, and power control model modifier. PL(d₀) is a reference path loss measured at distance d₀, and X.sub.σ is a zero-mean Gaussian distributed random variable (measured in dB) with a standard deviation of σ.

                  TABLE 1                                                          ______________________________________                                         Values of n for various base-station environments                              Environment           n                                                        ______________________________________                                         Free Space            2                                                        Urban Area Cellular Radio                                                                            2.7-3.5                                                  Shadowed Urban Area Cellular Radio                                                                   3-5                                                      In-Building Line of Sight                                                                            1.6-1.8                                                  Obstructed In-Building                                                                               4-6                                                      Obstructed In-Factory 2-3                                                      ______________________________________                                    

Given the direct relationship between a ray's time of arrival at the serving base station (t_(arrival)), expressed in a number of chips, and a distance, expressed in centimeters:

    d=12207*t.sub.arrival.

The path loss at the serving base station (PL(d)) can then be re-written as a function of the prompt ray arrival time t_(arrival) :

    PL(t.sub.arrival)= PL(t.sub.0)+10nlog(t.sub.arrival /t.sub.0)+X.sub.σ,

where t₀ is the arrival time of a prompt ray at distance d₀.

As discussed above, to evaluate a prompt ray's time of arrival (TOA) at non-serving base stations, a cross-correlation between the received signal and a version of a known signal sent by the remote unit is performed. As a result, correlation peaks at different times represent different paths followed by the signal. The correlation peaks exist over a noise floor created by thermal noise and other interferences. The magnitude of the correlation peaks is an estimation of each signal power, and are directly related to the size of the correlation window (N). In other words the power of the prompt ray (P_(prompt)) arriving at offset t_(arrival) is given by,

    P.sub.prompt (t.sub.arrival)˜N.

In order to keep the correlation peak detectable while maintaining a reduced processing load, the correlation window size (N) is increased as the remote unit's distance from the base station performing the search increases, and vice versa. The change in N at non-serving base stations mirrors the power loss PL(t_(arrival)) at the remote base station due to environmental factors (free space path loss, urban/suburban, power control, etc.). For example, if N₀ is the correlation window length at the reference distance from the remote base station for t₀ :

    ΔP(t.sub.arrival)=10log(N/N.sub.0)˜PL(t.sub.0)+10nlog(t.sub.arrival /t.sub.0)+X.sub.σ,

from where,

    N/N.sub.0 ˜10.sup.(PL(t0)+Xσ)/10 [t.sub.arrival /t.sub.0 ].sup.n =K*[t.sub.arrival /t.sub.0 ].sup.n,

which leaves, as a valid approximation:

    N=N.sub.0 *[t.sub.arrival /t.sub.0 ].sup.n.

Thus, if t₀ represents the time offset at the reference distance (expressed in PN chips), and N₀ represents the reference correlation window size used at that reference distance t₀, then in order to obtain a detectable correlation peak given a minimal windowing size, N should be varied as a function of the distance/offset under evaluation.

FIG. 7 is a flow chart showing the generation of a correlation window by a base station of FIG. 1 in accordance with the preferred embodiment of the present invention. The logic flow begins at step 701 where a lower value for value for t_(arrival) is chosen. As discussed above t_(arrival) is bounded on the low side by PN_(initial) and on the high side by PN_(final). Therefore, at step 701, t_(arrival) is set equal to PN_(initial). At step 705 a correlation window size for t_(arrival) is determined. In particular the correlation window size is set equal to N₀ *[t_(arrival) /to]^(n). At step 710 a correlation power is determined for t_(arrival) and reported to LFE 355. The logic flow then continues to step 715 where it is determined if t_(arrival) >PN_(final). If at step 715, t_(arrival) =PN_(final) then the logic flow ends at step 730, otherwise the logic flow continues to step 720 where it is determined if the correlation power is above a threshold. In particular, at step 720 a determination is made as to if the t_(arrival) has a high confidence of being the offset for the prompt ray. This is done by determining if the correlation power is above a threshold. If, at step 720 it is determined that the correlation power is above the threshold, then the logic flow ends at step 730, otherwise the logic flow continues to step 725. At step 725, t_(arrival) is advanced to the next offset under evaluation and the logic flow returns to step 705.

Although the preferred embodiment described in FIG. 7 "walked" though possible offsets for t_(arrival) in an alternate embodiment of the present invention, all possible offsets for t_(arrival) may be analyzed simultaneously. The alternate embodiment is better performed by implementation on an ASIC, wherein the preferred embodiment is better performed when implementation is in software.

The descriptions of the invention, the specific details, and the drawings mentioned above, are not meant to limit the scope of the present invention. For example, although TOA and TDOA have been utilized in the preferred embodiment of the present invention, one of ordinary skill in the art will recognize that other forms of location (e.g., various forms of propagation delay measurements on prompt rays, power measurements, amplitude differencing for AOA, generic searcher techniques for TOA determination, TDOA fusion techniques, etc.) may be utilized without varying from the scope of the present invention. Additionally, although the generation of the search and correlation windows is based on a distance "between" base stations, it is contemplated that an equivalent method for determining distances "between" base stations may be to determine each base station's distance to a fixed point, and use the distances to the fixed point in determining the search and correlation windows. It is the intent of the inventors that various modifications can be made to the present invention without varying from the spirit and scope of the invention, and it is intended that all such modifications come within the scope of the following claims and their equivalents. 

What is claimed is:
 1. A method for locating a remote unit within a communication system, the method comprising the steps of:receiving at a base station, a location request to perform a location of the remote unit, wherein the location request comprises a first location of the remote unit; and performing a location of the remote unit within a search window bounded by an upper and a lower time offset, wherein the step of performing is based on the location request, the first location of the remote unit, and a distance from the base station to a second base station, wherein the second base station performed the first location of the remote unit.
 2. The method of claim 1 wherein the step of receiving, at the base station, the location request comprises the step of receiving, at the base station, a request to participate in a multi-site location of the remote unit.
 3. The method of claim 1 wherein the step of receiving the request to participate in the multi-site location of the remote unit comprises the step of receiving a request to perform a multi-site Time Difference Of Arrival (TDOA) location of the remote unit.
 4. The method of claim 1 further comprising the step of searching for the remote unit with a receiver utilizing the search window, wherein the search window is based on the first location of the remote unit, and the distance (PN_(primary).sbsb.--_(site)) from the base station to the second base station.
 5. The method of claim 4 wherein the step of searching for the remote unit comprises the step of searching for the remote unit with the receiver utilizing a search window, wherein the search window is based on the first location of the remote unit, and the distance from the base station to the second base station, a bore site azimuth (.o slashed.)of the second base station, a sector size (β) of the second base station, and a sector within the second base station's coverage area.
 6. The method of claim 5 wherein the step of searching for the remote unit with the receiver utilizing a search window comprises the step of searching for the remote unit using a search window having a maximum (PN_(final)) and minimum (PN_(initial)) search window wherein

    PN.sub.initial =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2 -2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) COS (.o slashed.-

    (β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2)

    PN.sub.final =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2-

    2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.+(β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2).


7. The method of claim 3 wherein the step of searching for the remote unit with the receiver utilizing a search window comprises the step of searching for the remote unit using a search window having a maximum (PN_(initial)) and minimum (PN_(initial)) search window wherein

    PN.sub.initial =0

    PN.sub.final =2*PN.sub.primary.sbsb.--.sub.site.


8. The method of claim 4 wherein the step of searching for the remote unit with the receiver utilizing a search window comprises the step of searching for the remote unit using a search window having a maximum (PN_(initial)) and minimum (PN_(initial)) search window wherein

    PN.sub.initial =PN.sub.between.sbsb.--.sub.sites -PN.sub.primary.sbsb.--.sub.site

    PN.sub.final =PN.sub.between.sbsb.--.sub.sites +PN.sub.primary.sbsb.--.sub.site.


9. 9. A method for locating a remote unit within a communication system, the method comprising the steps of:receiving at a base station, a location request to perform a location of the remote unit, wherein the location request comprises a first location of the remote unit; instructing a receiver to search for the remote unit within a window bounded by an upper (PN_(initial)) and a lower (PN_(final)) PN offset, wherein PN_(initial) and PN_(final) are based on the first location of the remote unit (PN_(primary).sbsb.--_(site)) and a distance that the base station is from a second base station, wherein the second base station performed the first location of the remote unit; and performing a location of the remote unit based on the location request, the first location of the remote unit, and a distance from the base station to a second base station.
 10. The method of claim 9 wherein the step of receiving, at the base station, the location request comprises the step of receiving, at the base station, a request to participate in a multi-site location of the remote unit.
 11. The method of claim 10 wherein the step of receiving the request to participate in the multi-site location of the remote unit comprises the step of receiving a request to perform a multi-site Time Difference Of Arrival (TDOA) location of the remote unit.
 12. The method of claim 9 wherein the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) comprises the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) wherein PN_(initial) and PN_(final) are further based on a bore site azimuth of the second base station (.o slashed.), a sector size (β) of the second base station, and a sector within the second base station's coverage area.
 13. The method of claim 12 wherein the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) comprises the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) wherein

    PN.sub.initial =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2 -2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.-

    (β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2)

    PN.sub.final =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2-

    2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.+(β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2).


14. The method of claim 9 wherein the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) comprises the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) wherein

    PN.sub.initial =0

    PN.sub.final =2*PN.sub.primary.sbsb.--.sub.site.


15. The method of claim 9 wherein the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) comprises the step of instructing the receiver to search for the remote unit within the window bounded by PN_(initial) and PN_(final) wherein

    PN.sub.initial =PN.sub.between.sbsb.--.sub.sites -PN.sub.primary.sbsb.--.sub.site

    PN.sub.final =PN.sub.between.sbsb.--.sub.sites +PN.sub.primary.sbsb.--.sub.site.


16. A base station for locating a remote unit within a communication system, the base station comprises a logic unit having a location request and a first location as an input and outputting a search window for utilization by a receiver, wherein the search window is based on the location request, the first location of the remote unit, and a distance from the base station to a second base station, wherein the second base station performed the first location of the remote unit.
 17. The base station of claim 16 wherein the search window is bounded by PN_(initial) and PN_(final) wherein PN_(initial) and PN_(final) are based on a bore site azimuth of the second base station (.o slashed.), a sector size (β) of the second base station, and a sector within the second base station's coverage area.
 18. The base station of claim 17 wherein

    PN.sub.initial =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2 -2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.-

    (β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2)

    PN.sub.final =sqrt((PN.sub.between.sbsb.--.sub.sites).sup.2-

    2(PN.sub.primary.sbsb.--.sub.site)(PN.sub.between.sbsb.--.sub.sites) cos (.o slashed.+(β/2))+(PN.sub.primary.sbsb.--.sub.site).sup.2).


19. The base station of claim 17 wherein

    PN.sub.initial =0

    PN.sub.final =2*PN.sub.primary.sbsb.--.sub.site.


20. The base station of claim 17 wherein

    PN.sub.initial =PN.sub.between.sbsb.--.sub.sites -PN.sub.primary.sbsb.--.sub.site

    PN.sub.final =PN.sub.between.sbsb.--.sub.sites +PN.sub.primary.sbsb.--.sub.site. 